finite element mesh - определение. Что такое finite element mesh
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое finite element mesh - определение

PROJECT
NASA Finite Element Machine
  • left
Найдено результатов: 1561
Finite element method         
  • A function in <math>H_0^1,</math> with zero values at the endpoints (blue), and a piecewise linear approximation (red)
  • (c) The computed solution, <math>u(x, y)=1-x^2-y^2.</math>
  • (b) The [[sparse matrix]] ''L'' of the discretized linear system
  • Solving the two-dimensional problem <math>u_{xx}+u_{yy}=-4</math> in the disk centered at the origin and radius 1, with zero boundary conditions.<br />(a) The triangulation.
  • url=https://ris.utwente.nl/ws/files/6153316/CMBBE2014-Hamid-Submitted.pdf}}</ref>
  • A piecewise linear function in two dimensions
  • alt=
  • alt=
NUMERICAL METHOD FOR SOLVING PHYSICAL OR ENGINEERING PROBLEMS
Finite element analysis; Finite Element Analysis; Finite elements; Finite element; Finite Element Method; Engineering treatment of the finite element method; Finite element solver; Finite element meshing; Finite element problem; Engineering treatment of the Finite Element Method; Finite element methods; Finite difference method based on variation principle; Finite elements analysis; Finite-element method; Finite-element analysis; Finite-element methods; Nonlinear finite element analysis
The finite element method (FEM) is a popular method for numerically solving differential equations arising in engineering and mathematical modeling. Typical problem areas of interest include the traditional fields of structural analysis, heat transfer, fluid flow, mass transport, and electromagnetic potential.
Polygon mesh         
  • alt=
  • Figure 2. Vertex-vertex meshes
SET OF EDGES, VERTICES, AND POLYGONS WHICH DEFINE A 3D MODEL'S SHAPE
Polygon meshes; Polygonal mesh; 3D polygon mesh; Edge (computer graphics); 3D mesh; Mesh (computer graphics); Surface mesh; List of polygonal mesh file formats; Polygon mesh file formats
In 3D computer graphics and solid modeling, a polygon mesh is a collection of , s and s that defines the shape of a polyhedral object. The faces usually consist of triangles (triangle mesh), quadrilaterals (quads), or other simple convex polygons (n-gons), since this simplifies rendering, but may also be more generally composed of concave polygons, or even polygons with holes.
Fuzzy finite element         
Fuzzy Finite Element; Fuzzy finite element method
The fuzzy finite element method combines the well-established finite element method with the concept of fuzzy numbers, the latter being a special case of a fuzzy set.Michael Hanss, 2005.
Finite element machine         
The Finite Element Machine (FEM) was a late 1970s-early 1980s NASA project to build and evaluate the performance of a parallel computer for structural analysis. The FEM was completed and successfully tested at the NASA Langley Research Center in Hampton, Virginia.
Particle Mesh         
ALGORITHM FOR DETERMINING FORCES
Particle-mesh; Particle Mesh
Particle Mesh (PM) is a computational method for determining the forces in a system of particles. These particles could be atoms, stars, or fluid components and so the method is applicable to many fields, including molecular dynamics and astrophysics.
Particle mesh         
ALGORITHM FOR DETERMINING FORCES
Particle-mesh; Particle Mesh
Particle Mesh (PM) is a computational method for determining the forces in a system of particles. These particles could be atoms, stars, or fluid components and so the method is applicable to many fields, including molecular dynamics and astrophysics.
Finite morphism         
Finite map (algebraic geometry); Finite type scheme
In algebraic geometry, a finite morphism between two affine varieties X, Y is a dense regular map which induces isomorphic inclusion k\left[Y\right]\hookrightarrow k\left[X\right] between their coordinate rings, such that k\left[X\right] is integral over k\left[Y\right]. This definition can be extended to the quasi-projective varieties, such that a regular map f\colon X\to Y between quasiprojective varieties is finite if any point like y\in Y has an affine neighbourhood V such that U=f^{-1}(V) is affine and f\colon U\to V is a finite map (in view of the previous definition, because it is between affine varieties).
Element (mathematics)         
ANY ONE OF THE DISTINCT OBJECTS THAT MAKE UP A SET IN SET THEORY
Element (math); Element (set theory); ∈; ∉; Element (set); Set membership; ∋; Set element; Element (statistics); In (set); Element (group theory); Membership (set theory); ∊; ∍; ∌; Belongs to; Membership relation; Element of; /in
In mathematics, an element (or member) of a set is any one of the distinct objects that belong to that set.
Finite Automaton         
  • TTL]] counter, a type of state machine
  • Fig. 5: Representation of an acceptor; this example shows one that determines whether a binary number has an even number of 0s, where ''S''<sub>1</sub> is an ''accepting state'' and ''S''<sub>2</sub> is a ''non accepting state''.
  • Fig. 3 Example of a simple finite-state machine
  • Fig. 6 Transducer FSM: Moore model example
  • Fig. 7 Transducer FSM: Mealy model example
  • Fig. 4: Acceptor FSM: parsing the string "nice".
  • Fig. 2 SDL state machine example
  • A turnstile
  • State diagram for a turnstile
  • Fig. 1 UML state chart example (a toaster oven)
MATHEMATICAL MODEL OF COMPUTATION; ABSTRACT MACHINE THAT CAN BE IN EXACTLY ONE OF A FINITE NUMBER OF STATES AT ANY GIVEN TIME
Finite state machines; Finite state automaton; Finite automaton; Finite state automata; Start state; Finite automata; Deterministic automata; State machine; SFSM; Finite State Machine; Finate state automata; Accept state; Accepting state; State Machine; State machines; Recognizer; Recognizers; Sequence detector; Sequence detectors; Finite state acceptor; Finite State Automaton; State transition function; Finite State Machines; Finite-state automata; Finite-state automaton; Finite state machine; Finite state grammar; Finite-state machines; Finite state-machine; Finite state language; Finite state; Finite Automata; Finite state recognizer; Finite-state recognizer; State-machine; Acceptor (finite-state machine); Optimization of finite state machines; Recogniser
Finite volume method         
METHOD FOR REPRESENTING AND EVALUATING PARTIAL DIFFERENTIAL EQUATIONS
Finite volume; Finite-volume method
The finite volume method (FVM) is a method for representing and evaluating partial differential equations in the form of algebraic equations.

Википедия

Finite element machine

The Finite Element Machine (FEM) was a late 1970s-early 1980s NASA project to build and evaluate the performance of a parallel computer for structural analysis. The FEM was completed and successfully tested at the NASA Langley Research Center in Hampton, Virginia. The motivation for FEM arose from the merger of two concepts: the finite element method of structural analysis and the introduction of relatively low-cost microprocessors.

In the finite element method, the behavior (stresses, strains and displacements resulting from load conditions) of large-scale structures is approximated by a FE model consisting of structural elements (members) connected at structural node points. Calculations on traditional computers are performed at each node point and results communicated to adjacent node points until the behavior of the entire structure is computed. On the Finite Element Machine, microprocessors located at each node point perform these nodal computations in parallel. If there are more node points (N) than microprocessors (P), then each microprocessor performs N/P computations. The Finite Element Machine contained 32 processor boards each with a Texas Instruments TMS9900 processor, 32 Input/Output (IO) boards and a TMS99/4 controller. The FEM was conceived, designed and fabricated at NASA Langley Research Center. The TI 9900 processor chip was selected by the NASA team as it was the first 16-bit processor available on the market which until then was limited to less powerful 8-bit processors. The FEM concept was first successfully tested to solve beam bending equations on a Langley FEM prototype (4 IMSAI 8080s). This led to full-scale FEM fabrication & testing by the FEM hardware-software-applications team led by Dr. Olaf Storaasli formerly of NASA Langley Research Center and Oak Ridge National Laboratory (currently at USEC). The first significant Finite Element Machine results are documented in: The Finite Element Machine: An experiment in parallel processing (NASA TM 84514).

Based on the Finite Element Machine's success in demonstrating Parallel Computing viability, (alongside ILLIAC IV and Goodyear MPP), commercial parallel computers soon were sold. NASA Langley subsequently purchased a Flex/32 Multicomputer (and later Intel iPSC and Intel Paragon) to continue parallel finite element algorithm R&D. In 1989, the parallel equation solver code, first prototyped on FEM, and tested on FLEX was ported to NASA's first Cray YMP via Force (Fortran for Concurrent Execution) to reduce the structural analysis computation time for the space shuttle Challenger Solid Rocket Booster resdesign with 54,870 equations from 14 hours to 6 seconds. This research accomplishment was awarded the first Cray GigaFLOP Performance Award at Supercomputing '89. This code evolved into NASA's General-Purpose Solver (GPS) for Matrix Equations used in numerous finite element codes to speed solution time. GPS sped up AlphaStar Corporation's Genoa code 10X, allowing 10X larger applications for which the team received NASA's 1999 Software of the Year Award and a 2000 R&D100 Award.